Heuristic algorithms for the multiple-choice multidimensional knapsack problem
نویسندگان
چکیده
منابع مشابه
A New Strategy for Solving Multiple-Choice Multiple-Dimension Knapsack Problem in PRAM Model
This paper presents a new heuristic algorithm for the MultipleChoice Multi-Dimension Knapsack Problem (MMKP) in PRAM model. MMKP is a variant of the classical 0-1 knapsack problem, has a knapsack with multidimensional capacity constraints, groups of items, each item having a utility value and multidimensional resource constraints. The problem is to maximize the total value of the items in the k...
متن کاملSolving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls
This paper presents a heuristic to solve the Multidimensional Multiple-choice Knapsack Problem (MMKP), a variant of the classical 0–1 Knapsack Problem. We apply a transformation technique to map the multidimensional resource consumption to single dimension. Convex hulls are constructed to reduce the search space to find the near-optimal solution of the MMKP. We present the computational complex...
متن کاملOverview of the Algorithms for Solving the Multidimensional Knapsack Problems
The multidimensional knapsack problem is defined as an optimization problem that is NP-hard combinatorial. The multidimensional knapsack problems have large applications, which include many applicable problems from different area, like cargo loading, cutting stock, bin-packing, financial and other management, etc. This paper reviews some researches published in the literature. The concentrate i...
متن کاملA "reduce and solve" approach for the multiple-choice multidimensional knapsack problem
The multiple-choice multidimensional knapsack problem (MMKP) is a well-known NP-hard combinatorial optimization problem with a number of important applications. In this paper, we present a ”reduce and solve” heuristic approach which combines problem reduction techniques with an Integer Linear Programming (ILP) solver (CPLEX). The key ingredient of the proposed approach is a set of group fixing ...
متن کاملModified Choice Function Heuristic Selection for the Multidimensional Knapsack Problem
Hyper-heuristics are a class of high-level search methods used to solve computationally difficult problems, which operate on a search space of low-level heuristics rather than solutions directly. Previous work has shown that selection hyper-heuristics are able to solve many combinatorial optimisation problems, including the multidimensional 0-1 knapsack problem (MKP). The traditional framework ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JORS
دوره 55 شماره
صفحات -
تاریخ انتشار 2004